Optimization of Network Packet Scheduling–using Multi Objective Genetic Algorithm with Virtual Deadline as a Schedule Parameter

نویسندگان

  • Yuting zhang
  • Richard
  • Mohd Farhan Ngatman
  • Johan
چکیده

MOGA along with virtual deadline is capable of outperforming the Dynamic Window Constraint Scheduling(DWCS) by servicing jobs with different request periods .Additionally, MOGA with virtual deadline yields better results than Virtual Deadline Scheduling(VDS) because the context switching time is less in the former. Eventually, an implementation of MOGA with virtual deadline as a schedule parameter in the Linux Kernel with the help of Wireshark, a network protocol analyzer that captures the real-time network packets, which produces better scheduling results than DWCS and VDS.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective Optimization of Multimedia Packet Scheduling for Ad Hoc Networks through Hybridized Genetic Algorithm

This paper presents a new approach to optimize the schedule of the variable length multimedia packets in Ad hoc networks using hybridized Genetic Algorithm (HGA).Existing algorithm called Virtual Deadline Scheduling (VDS) attempts to guarantee m out of k job instances (consecutive packets in a real-time stream) by their deadlines are serviced. VDS is capable of generating a feasible window cons...

متن کامل

Modeling and Solution Procedure for a Preemptive Multi-Objective Multi-Mode Project Scheduling Model in Resource Investment Problems

In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...

متن کامل

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

متن کامل

A knowledge-based NSGA-II approach for scheduling in virtual manufacturing cells

This paper considers the job scheduling problem in virtual manufacturing cells (VMCs) with the goal of minimizing two objectives namely, makespan and total travelling distance. To solve this problem two algorithms are proposed: traditional non-dominated sorting genetic algorithm (NSGA-II) and knowledge-based non-dominated sorting genetic algorithm (KBNSGA-II). The difference between these algor...

متن کامل

A Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm

In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016